Model Checking the Garbage Collection Mechanism of SMV
نویسندگان
چکیده
منابع مشابه
Memoised Garbage Collection for Software Model Checking
Virtual machine based software model checkers like jpf and MoonWalker spend up to half of their verification time on garbage collection. This is no surprise as after nearly each transition the heap has to be cleaned from garbage. To improve this, this paper presents the Memoised Garbage Collection (MGC) algorithm, which exploits the (typical) locality of transitions to incrementally perform gar...
متن کاملUsing Garbage Collection in Model Checking
Garbage collection techniques have become common-place in actual programming environments, helping programmers to avoid memory fragmentation and invalid referencing problems. In order to e ciently model check programs that use garbage collection, similar functionalities have to be embedded in model checkers. This paper focuses on the implementation of two classic garbage collection algorithms i...
متن کاملFormal Proof of Abstract Model Checking of Concurrent Garbage Collection
Abstract model checking is a method to verify properties of a state transition system by first making abstraction of the system and then applying model checking on the abstract system. If the employed abstraction relation satisfies certain conditions that guarantee the correctness of the abstraction, verification results of the abstract system can be shifted to the original one. However, the co...
متن کاملModel Checking Rebeca Code by SMV
Object-based modelling is known to be an appropriate approach for representing concurrent and distributed systems. Besides having an appropriate and efficient way for modelling these systems, one needs a formal verification approach for ensuring their correctness. We have developed a tool for translating our actor-based model, Rebeca, to SMV. It enables us to model check Rebeca codes. We also s...
متن کاملModel Checking PSL Using HOL and SMV
In our previous work, we formally validated the correctness of a translation from a subset of Accellera’s Property Specification Language (PSL) to linear temporal logic (LTL) using the HOL theorem prover. We also built an interface from HOL to the SMV model checker based on a formal translation of LTL to ω-automata. In the present paper, we describe how this work has been extended and combined ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2001
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00258-0